Minimum spanning tree

Results: 280



#Item
11arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

Add to Reading List

Source URL: www.grupolys.org

Language: English - Date: 2016-05-11 06:39:57
12Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
131 Disk Covering Methods: improving the accuracy and speed of large-scale phylogenetic analyses 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.2 Phylogenetic ana

1 Disk Covering Methods: improving the accuracy and speed of large-scale phylogenetic analyses 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.2 Phylogenetic ana

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-08-30 15:58:30
14Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
15On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh†  Bernard Lidick´

On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:58
16CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-10 00:55:12
17Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2  IIT Delhi, India,

Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-12-11 12:58:32
18Spanning tree / Mathematics / Distributed computing / Minimum spanning tree / Routing / Algorithm

CPSC 455b Written Homework Assignment # 1

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2011-08-29 17:33:56
19Efficient Hierarchical Graph-Based Segmentation of RGBD Videos Steven Hickson1 Stan Birchfield2  Irfan Essa1

Efficient Hierarchical Graph-Based Segmentation of RGBD Videos Steven Hickson1 Stan Birchfield2 Irfan Essa1

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2014-07-16 10:51:30
20Output-Sensitive Construction of the Union of Triangles   Esther Ezra and Micha Sharir School of Computer Science

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2007-08-27 22:45:23